Stochastic Iterative Decoding on Factor Graphs
نویسندگان
چکیده
An iterative decoding architecture based on stochastic computational elements is studied. Simulation results for a (7,4) Hamming code show only about a 0.5dB loss with respect to a belief propagationbased decoder. The critical path of the decoder is a single XOR gate, allowing it to operate at very high speed. The proposed method provides a digital, technology independent, alternative to analog decoding for high-throughput and low-power digital communications applications.
منابع مشابه
A Novel Stochastic Decoding of LDPC Codes with Quantitative Guarantees
Low-density parity-check codes, a class of capacity-approaching linear codes, are particularly recognized for their efficient decoding scheme. The decoding scheme, known as the sum-product, is an iterative algorithm consisting of passing messages between variable and check nodes of the factor graph. The sum-product algorithm is fully parallelizable, owing to the fact that all messages can be up...
متن کاملIterative Decoding of Compound Codes by Probability Propagation in Graphical Models
We present a unified graphical model framework for describing compound codes and deriving iterative decoding algorithms. After reviewing a variety of graphical models (Markov random fields, Tanner graphs, and Bayesian networks), we derive a general distributed marginalization algorithm for functions described by factor graphs. From this general algorithm, Pearl’s belief propagation algorithm is...
متن کاملUnified design of iterative receivers using factor graphs
Iterative algorithms are an attractive approach to approximating optimal, but high-complexity, joint channel estimation and decoding receivers for communication systems. We present a unified approach based on factor graphs for deriving iterative message-passing receiver algorithms for channel estimation and decoding. For many common channels, it is easy to find simple graphical models that lead...
متن کاملBelief Propagation Decoding of Polar Codes on Permuted Factor Graphs
We show that the performance of iterative belief propagation (BP) decoding of polar codes can be enhanced by decoding over different carefully chosen factor graph realizations. With a genie-aided stopping condition, it can achieve the successive cancellation list (SCL) decoding performance which has already been shown to achieve the maximum likelihood (ML) bound provided that the list size is s...
متن کاملCodes and Decoding on General Graphs
Iterative decoding techniques have become a viable alternative for constructing high performance coding systems. In particular, the recent success of turbo codes indicates that performance close to the Shannon limit may be achieved. In this thesis, it is showed that many iterative decoding algorithms are special cases of two generic algorithms, the min-sum and sum-product algorithms, which also...
متن کامل